A Variant of Concurrent Constraint Programming on GPU
نویسندگان
چکیده
The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the clock speed processors stagnates. Unfortunately, constraint programming solvers do not take advantage yet GPU parallelism. One reason that were primarily designed within mental frame sequential computation. To solve this issue, we a step back and contribute to simple, intrinsically parallel, lock-free formally correct language based concurrent programming. We then re-examine parallel solving GPUs formalism, develop Turbo, simple solver entirely programmed GPUs. Turbo validates correctness our approach compares positively CPU-based solver.
منابع مشابه
A Multimedia Programming Model Based on Timed Concurrent Constraint Programming
We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The real-time extensions that have been proposed for the concurrent constraint programming framework are coupled with the object-oriented and inheritance mechanisms that have been ...
متن کاملTruly Concurrent Constraint Programming
We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully-abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained st...
متن کاملSubexponential concurrent constraint programming
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of ...
متن کاملTemporal Concurrent Constraint Programming
The temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint) from the environment, it executes with this stimulus as the initial store, and when it reaches its resting point, it responds to the environment with the resulting store. Also the resting p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2022
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v36i4.20298